- sci|o|graph|ic
- sci|o|graph|ic «SY uh GRAF ihk», adjective.= skiagraphic. (Cf. ↑skiagraphic)
Useful english dictionary. 2012.
sci|o|graph|ic
Look at other dictionaries:
sci|a|graph|ic — «SY uh GRAF ihk», adjective. = skiagraphic. (Cf. ↑skiagraphic) … Useful english dictionary
sci|a|graph — «SY uh graf, grahf», noun, transitive verb. = skiagraph. (Cf. ↑skiagraph) … Useful english dictionary
sci|o|graph — «SY uh graf, grahf», noun, verb. = skiagraph. (Cf. ↑skiagraph) … Useful english dictionary
Moore graph — Unsolved problems in mathematics Does a Moore graph with girth 5 and degree 57 exist? In graph theory, a Moore graph is a regular graph of degree d and diameter k whose number of vertices equals the upper bound An equivalent definition of a Moore … Wikipedia
Interval graph — In graph theory, an interval graph is the intersection graph of a set of intervals on the real line. It has one vertex for each interval in the set, and an edge between every pair of vertices corresponding to intervals that intersect.Formally,… … Wikipedia
Critical graph — In general the notion of criticality can refer to any measure. But in graph theory, when the term is used without any qualification, it almost always refers to the chromatic number of a graph. Critical graphs are interesting because they are the… … Wikipedia
Claw-free graph — A claw In graph theory, an area of mathematics, a claw free graph is a graph that does not have a claw as an induced subgraph. A claw is another name for the complete bipartite graph K1,3 (that is, a star graph with three edges, three leaves, and … Wikipedia
Circle graph — For the chart, see Pie chart. A circle with five chords and the corresponding circle graph. In graph theory, a circle graph is the intersection graph of a set of chords of a circle. That is, it is an undirected graph whose vertices can be… … Wikipedia
König's theorem (graph theory) — In the mathematical area of graph theory, König s theorem describes an equivalence between the maximum matching problem and the minimum vertex cover problem in bipartite graphs. Setting A graph is bipartite if its vertices can be partitioned into … Wikipedia
Comparability graph — In graph theory, a comparability graph is an undirected graph that connects pairs of elements that are comparable to each other in a partial order. Comparability graphs have also been called transitively orientable graphs, partially orderable… … Wikipedia
